Signal Representations on Graphs: Tools and Applications

نویسندگان

  • Siheng Chen
  • Rohan Varma
  • Aarti Singh
  • Jelena Kovacevic
چکیده

S. Chen and R. Varma are with the Department of Electrical and Computer Engineering, Carnegie Mellon University, Pittsburgh, PA, 15213 USA. Email: [email protected], [email protected]. A. Singh is with the Department of Machine Learning, Carnegie Mellon University, Pittsburgh, PA. Email: [email protected]. J. Kovačević is with the Departments of Electrical and Computer Engineering and Biomedical Engineering, Carnegie Mellon University, Pittsburgh, PA. Email: [email protected]. The authors gratefully acknowledge support from the NSF through awards 1130616,1421919, the University Transportation Center grant (DTRT12GUTC11) from the US Department of Transportation, and the CMU Carnegie Institute of Technology Infrastructure Award. VI Representations of Piecewise-smooth Graph Signals 22 VI-A Graph Signal Models . . . . . . . . . . 22 VI-B Graph Dictionary . . . . . . . . . . . . 23 VI-B1 Properties . . . . . . . . . . 23 VI-C Graph Signal Processing Tasks . . . . . 24 VI-C1 Approximation . . . . . . . . 24 VI-C2 Sampling and Recovery . . . 25 VI-D Case Study: Environmental Change Detection . . . . . . . . . . . . . . . . . . 25

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

EFFICIENT DESIGN OF EMBEDDED SIGNAL PROCESSING SYSTEMS USING TOPOLOGICAL PATTERNS BASED DATAFLOW GRAPH REPRESENTATIONS by

Tools for designing signal processing systems with their semantic foundation in dataflow modeling often use high-level graphical user interfaces (GUIs) or text based languages that allow specifying applications as directed graphs. Such graphical representations serve as an initial reference point for further analysis and optimizations that lead to platform-specific implementations. For large-sc...

متن کامل

Topological Patterns for Scalable Representation and Analysis of Dataflow Graphs

Tools for designing signal processing systems with their semantic foundation in dataflow modeling often use high-level graphical user interfaces (GUIs) or text based languages that allow specifying applications as directed graphs. Such graphical representations serve as an initial reference point for further analysis and optimizations that lead to platform-specific implementations. For large-sc...

متن کامل

CRITICALLY SAMPLED WAVELET FILTERBANKS ON GRAPHS by Sunil K . Narang A Dissertation

Emerging data mining applications will have to operate on datasets defined on graphs. Examples of such datasets include online document networks, social networks, and transportation networks etc. The data on these graphs can be visualized as a finite collection of samples, a graph-signal which can be defined as the information attached to each node (scalar or vector values mapped to the set of ...

متن کامل

On the distance eigenvalues of Cayley graphs

In this paper, we determine the distance matrix and its characteristic polynomial of a Cayley graph over a group G in terms of irreducible representations of G. We give exact formulas for n-prisms, hexagonal torus network and cubic Cayley graphs over abelian groups. We construct an innite family of distance integral Cayley graphs. Also we prove that a nite abelian group G admits a connected...

متن کامل

A fast algorithm for vertex-frequency representations of signals on graphs

The windowed Fourier transform (short time Fourier transform) and the S-transform are widely used signal processing tools for extracting frequency information from non-stationary signals. Previously, the windowed Fourier transform had been adopted for signals on graphs and has been shown to be very useful for extracting vertex-frequency information from graphs. However, high computational compl...

متن کامل

Poset Topology: Tools and Applications

Contents Poset Topology: Tools and Applications 1 Introduction 3 Lecture 1. Basic definitions, results, and examples 5 1.1. Order complexes and face posets 5 1.2. The Möbius function 9 1.3. Hyperplane and subspace arrangements 11 1.4. Some connections with graphs, groups and lattices 16 1.5. Poset homology and cohomology 17 1.6. Top cohomology of the partition lattice 19 Lecture 2. Group action...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1512.05406  شماره 

صفحات  -

تاریخ انتشار 2015